Implementing Implicit Schemes in GENSMAC
نویسندگان
چکیده
منابع مشابه
Implicit and Semi - Implicit Schemes :
We formulate general guidelines to extend an explicit code with a great variety of implicit and semi-implicit time integration schemes. The discussion is based on their speciic implementation in the Versatile Advection Code, which is a general purpose software package for solving systems of non-linear hyperbolic (and/or parabolic) partial diierential equations, using standard high-resolution sh...
متن کاملImplementing Implicit Self-Adjusting Computation
Computational problems that involve dynamic data have been an important subject of study in programming languages. Recent advances in self-adjusting computation have developed techniques that enable programs to respond automatically and efficiently to dynamic changes in their inputs. But these techniques have required an explicit programming style, where the programmer must use specific monadic...
متن کاملImplicit Schemes and Lu Decompositions
Implicit methods for hyperbolic equations are analyzed using LU decompositions. It is shown that the inversion of the resulting tridiagonal matrices is usually stable even when diagonal dominance is lost. Furthermore, these decompositions can be used to construct stable algorithms in multidimensions. When marching to a steady state, the solution is independent of the time. Alternating direction...
متن کاملImplicit-Explicit Schemes for BGK Kinetic Equations
In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be constructed with this technique. The methods proposed are based on an explicit-implicit time discretization. In particular the convective terms are treated explicitly, while the source terms are implicit. In this fashion ...
متن کاملHistory-based Schemes and Implicit Path Enumeration
The Implicit Path Enumeration Technique is often used to compute the WCET of control-intensive programs. This method does not consider execution paths as ordered sequences of basic blocks but instead as sets of basic blocks with their respective execution counts. This way of describing an execution path is adequate to compute its execution time, provided that safe individual WCETs for the block...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TEMA - Tendências em Matemática Aplicada e Computacional
سال: 2004
ISSN: 2179-8451,1677-1966
DOI: 10.5540/tema.2004.05.02.0259